Highly irregular quantum constraints
نویسندگان
چکیده
منابع مشابه
Highly Irregular Quantum Constraints
Motivated by a recent paper of Louko and Molgado, we consider a simple system with a single classical constraint R(q) = 0. If ql denotes a generic solution to R(q) = 0, our examples include cases where R(ql) 6= 0 (regular constraint) and R(ql) = 0 (irregular constraint) of varying order as well as the case where R(q) = 0 for an interval, such as a ≤ q ≤ b. Quantization of irregular constraints ...
متن کاملDegree sequences of highly irregular graphs
We call a simple graph highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we examine the degree sequences of highly irregular graphs. We give necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a highly irregular graph.
متن کاملImproved Secret Key Rate in Quantum Key Distribution using highly irregular Low-Density Parity-Check codes
Quantum key distribution (QKD) has proven to be the most mature subfield of quantum information theory, elegantly spanning the gap between theory and practice. It is a simple, and yet sophisticated idea, in which the fundamental principles of modern quantum mechanics are employed to distribute a provably secure cryptographic key between two parties. With many variations of this scheme realized,...
متن کاملIrregular time dependent perturbations of quantum Hamiltonians
Our main goal in this paper is to prove existence (and uniqueness) of the quantum propagator for time dependent quantum Hamiltonians Ĥ(t) when this Hamiltonian is perturbed with a quadratic white noise β̇K̂. β is a continuous function in time t, β̇ its time derivative and K is a quadratic Hamiltonian. K̂ is the Weyl quantization of K. For time dependent quadratic Hamiltonians H(t) we recover, under...
متن کاملScheduling with periodic availability constraints and irregular cost functions
This paper addresses a one-machine scheduling problem in which the efficiency of the machine is not constant, that is the duration of a task is longer in badly efficient time periods. Each task has an irregular completion cost. Under the assumption that the efficiency constraints are time-periodic, we show that the special case where the sequence is fixed can be solved in polynomial time. The g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Classical and Quantum Gravity
سال: 2006
ISSN: 0264-9381,1361-6382
DOI: 10.1088/0264-9381/23/10/025